The discretized discrepancy principle under general source conditions
نویسندگان
چکیده
منابع مشابه
The discretized discrepancy principle under general source conditions
We discuss adaptive strategies for choosing regularization parameters in TikhonovPhillips regularization of discretized linear operator equations. Two rules turn out to be entirely based on the underlying regularization scheme. Among them only the discrepancy principle allows to search for the optimal regularization parameter from the easiest problem. This possible advantage cannot be used with...
متن کاملFurther convergence results on the general iteratively regularized Gauss-Newton methods under the discrepancy principle
We consider the general iteratively regularized Gauss-Newton methods xk+1 = x0 − gαk (F (xk)F (xk))F (xk) ( F (xk)− y − F (xk)(xk − x0) ) for solving nonlinear inverse problems F (x) = y using the only available noise yδ of y satisfying ‖yδ − y‖ ≤ δ with a given small noise level δ > 0. In order to produce reasonable approximation to the sought solution, we terminate the iteration by the discre...
متن کاملOn the discrepancy principle
A simple proof of the convergence of the variational regularization, with the regularization parameter, chosen by the discrepancy principle, is given for linear operators under suitable assumptions. It is shown that the discrepancy principle, in general, does not yield uniform with respect to the data convergence. An a priori choice of the regularization parameter is proposed and justified for ...
متن کاملA new discrepancy principle
The aim of this note is to prove a new discrepancy principle. The advantage of the new discrepancy principle compared with the known one consists of solving a minimization problem (see problem (2) below) approximately, rather than exactly, and in the proof of a stability result. To explain this in more detail, let us recall the usual discrepancy principle, which can be stated as follows. Consid...
متن کاملDiscrepancy principle for DSM
Let Ay = f , A is a linear operator in a Hilbert space H, y ⊥ N (A) := {u : Au = 0}, R(A) := {h : h = Au, u ∈ D(A)} is not closed, f δ − f ≤ δ. Given f δ , one wants to construct u δ such that lim δ→0 u δ − y = 0. A version of the DSM (dynamical systems method) for finding u δ consists of solving the problem ˙ u δ (t) = −u δ (t) + T −1 a(t) A * f δ , u(0) = u 0 , (*) where T := A * A, T a := T ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2006
ISSN: 0885-064X
DOI: 10.1016/j.jco.2005.06.008